Exhaustive search of convex pentagons which tile the plane
نویسنده
چکیده
We present an exhaustive search of all families of convex pentagons which tile the plane. This research shows that there are no more than the already 15 known families. In particular, this implies that there is no convex polygon which allows only non-periodic tilings.
منابع مشابه
Equilateral Convex Pentagons Which Tile the Plane
It is shown that an equilateral convex pentagon tiles the plane if and only if it has two angles adding to 180 o or it is the unique equilateral convex pentagon with Although the area of mathematical tilings has been of interest for a long time there is still much to be discovered. We do not even know which convex polygons tile the plane. Furthermore, for those polygons which do tile, new tilin...
متن کاملSystematic Study of Convex Pentagonal Tilings, II: Tilings by Convex Pentagons with Four Equal-length Edges
We derived 14 types of tiling cases under a restricted condition in our previous report, which studied plane tilings with congruent convex pentagons. That condition is referred to as the category of the simplest set of node (vertex of edge-to-edge tiling) conditions when the tile is a convex pentagon with four equal-length edges. This paper shows the detailed properties of convex pentagonal til...
متن کاملConvex Pentagons for Edge-to-Edge Tiling, III
We introduce a plan toward a perfect list of convex pentagons that can tile the whole plane in edge-to-edge manner. Our strategy is based on Bagina’s Proposition, and is direct and primitive: Generating all candidates of pentagonal tiles (several hundreds in number), classify them into the known 14 types, geometrically impossible cases, the cases that do not generate an edge-to-edge pentagonal ...
متن کاملDisjoint empty convex pentagons in planar point sets
Harborth [Elemente der Mathematik, Vol. 33 (5), 116–118, 1978] proved that every set of 10 points in the plane, no three on a line, contains an empty convex pentagon. From this it follows that the number of disjoint empty convex pentagons in any set of n points in the plane is least ⌊ n 10 ⌋. In this paper we prove that every set of 19 points in the plane, no three on a line, contains two disjo...
متن کاملTiling the Plane with Permutations
A permutomino is a polyomino uniquely defined by a pair of permutations. Recently permutominoes, and in particular convex permutominoes have been studied by several authors concerning their analytical and bijective enumeration, tomographical reconstruction, and the algebraic characterization of the associated permutations [2, 3]. On the other side, Beauquier and Nivat [5] introduced and gave a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017